Initialization and Local Search Methods Applied to the Set Covering Problem: A Systematic Mapping

The set covering problem (SCP) is a classical combinatorial optimization part of Karp's 21 NP-complete problems. Many real-world applications can be modeled as problems (SCPs), such locating emergency services, military planning, and decision-making in COVID-19 pandemic context. Among the approaches that this type has solved are heuristic (H) metaheuristic (MH) algorithms, which integrate iterative methods procedures to explore exploit search space intelligently. In present research, we carry out systematic mapping literature focused on initialization local used these algorithms have been applied SCP order identify them they other algorithms. This was carried three main stages: research implementation, documentation results. results indicate most method random with search, inclusion MH improves obtained comparison those without search. Moreover, modify evaluate impact generate obtained.